Generalized honeycomb torus is Hamiltonian
نویسندگان
چکیده
Generalized honeycomb torus is a candidate for interconnection network architectures, which includes honeycomb torus, honeycomb rectangular torus, and honeycomb parallelogramic torus as special cases. Existence of Hamiltonian cycle is a basic requirement for interconnection networks since it helps map a “token ring” parallel algorithm onto the associated network in an efficient way. Cho and Hsu [Inform. Process. Lett. 86 (4) (2003) 185–190] speculated that every generalized honeycomb torus is Hamiltonian. In this paper, we have proved this conjecture. 2004 Elsevier B.V. All rights reserved.
منابع مشابه
Ring embedding in faulty honeycomb rectangular torus
Assume that m and n are positive even integers with n 4. The honeycomb rectangular torus HReT(m,n) is recognized as another attractive alternative to existing torus interconnection networks in parallel and distributed applications. It is known that any HReT(m,n) is a 3-regular bipartite graph. We prove that any HReT(m,n) − e is hamiltonian for any edge e ∈ E(HReT(m,n)). Moreover, any HReT(m,n)−...
متن کاملIntegrating the Generalized-Honeycomb-Torus for Sustainable Parking Structures in the Globalizing Age
Considering disaster sensitivity especially in developing large-scale, multiple-use parking structures, we propose dual-surveillance based SCADA (supervisory control and data acquisition) networks modeled from Generalized Honeycomb Tori -i.e. GHT(m,n,0)/GHT(m,n,n/2), which are proved 1-edge hamiltonian if n≥4; 1p-hamiltonian if n≥6 or m=2, n≥4, m and n can be specified in a node matrix for a pa...
متن کاملGeneralized Complex Hamiltonian Torus Actions: Examples and Constraints
Consider an effective Hamiltonian torus action T ×M → M on a topologically twisted, generalized complex manifold M of dimension 2n. We prove that the rank(T ) ≤ n − 2 and that the topological twisting survives Hamiltonian reduction. We then construct a large new class of such actions satisfying rank(T ) = n − 2, using a surgery procedure on toric manifolds.
متن کاملOne-to-One Embedding between Honeycomb Mesh and Petersen-Torus Networks
As wireless mobile telecommunication bases organize their structure using a honeycomb-mesh algorithm, there are many studies about parallel processing algorithms like the honeycomb mesh in Wireless Sensor Networks. This paper aims to study the Peterson-Torus graph algorithm in regard to the continuity with honeycomb-mesh algorithm in order to apply the algorithm to sensor networks. Once a new i...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 92 شماره
صفحات -
تاریخ انتشار 2004